Fuzzy Partition based Similarity Measure for Spectral Clustering

نویسندگان

  • Yifang Yang
  • Yuping Wang
چکیده

The efficiency of spectral clustering depends heavily on the similarity measure adopted. A widely used similarity measure is the Gaussian kernel function where Euclidean distance is used. Unfortunately, the result of spectral clustering is very sensitive to the scaling parameter and the Euclidean distance is usually not suitable to the complex distribution data. In this paper, a spectral clustering algorithm based on fuzzy partition similarity measure ( FPSC) is presented to solve the problem that result of spectral clustering is very sensitive to scaling parameter. The proposed algorithm is steady extremely and hardly affected by the scaling parameter. Experiments on three benchmark datasets, two synthetic texture images are made, and the results demonstrate the effectiveness of the proposed algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

Learning Spectral Clustering

Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same cluster having high similarity and points in different clusters having low similarity. In this paper, we derive a new cost function for spectral clustering based on a measure of error between a given partition and a solut...

متن کامل

A spectral clustering algorithm based on intuitionistic fuzzy information

In this paper, we propose a technique for clustering data with intuitionistic fuzzy information. We first define two new intuitionistic fuzzy similarity measures, and then use it to construct an intuitionistic fuzzy similarity measure matrix, by which we present a spectral algorithm to cluster intuitionistic fuzzy information. At last, two numerical examples are given to illustrate and verify o...

متن کامل

Improving Imbalanced data classification accuracy by using Fuzzy Similarity Measure and subtractive clustering

 Classification is an one of the important parts of data mining and knowledge discovery. In most cases, the data that is utilized to used to training the clusters is not well distributed. This inappropriate distribution occurs when one class has a large number of samples but while the number of other class samples is naturally inherently low. In general, the methods of solving this kind of prob...

متن کامل

Spectral indexes of quality, diversity and stability in fuzzy clustering

Quality assessment in clustering is a long-standing problem. In this contribution we describe some indexes to measure properties of clusterings, taking advantage of the added flexibility provided by fuzzy paradigms. We first present an approach to evaluate some indicators of quality of an individual clustering, by analyzing the co-association matrix. Then we describe a technique to evaluate the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016